Exploiting semantics of temporal multi‐scale methods to optimize multi‐level mesh partitioning
نویسندگان
چکیده
منابع مشابه
Exploiting Domain Knowledge to Optimize Mesh Partitioning for Multi-Scale Methods
Multi-scale methods are widely used in complex scientific computing problems [1], [2] which allow problem domains to be decomposed into smaller parts and simulated with different spatial and temporal scales. This way, “the area of interest” is simulated at a finer granularity and higher computation cost while the rest of the system is approximated with a much coarser model. Recursive domain-dec...
متن کاملMultilevel mesh partitioning for heterogeneous communication networks
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cu...
متن کاملMultilevel Mesh Partitioning for Aspect Ratio
Abstract. Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut-edge weight, however it has been shown that for c...
متن کاملMultilevel Mesh Partitioning for Optimising Domain Shape
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for mapping meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut-edge weight in t...
متن کاملParallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the problem to a set of independent problems in interface regions. Alternating optimisation is restriction of this technique in which mesh entities are only allowed to migrate between subdomains in one direction. The thir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2017
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.5506